Learn Your Opponent ' s Strategy ( in Polynomial Time ) !
نویسنده
چکیده
Agents that interact in a distributed environment might increase their utility by behaving optimally given the strategies of the other agents. To do so, agents need to learn about those with whom they share the same world. This paper examines interactions among agents from a game theoretic perspective. In this context , learning has been assumed as a means to reach equilibrium. We analyze the complexity of this learning process. We start with a restricted two{agent model, in which agents are represented by nite automata, and one of the agents plays a xed strategy. We show that even with this restrictions, the learning process may be exponential in time. We then suggest a criterion of simplicity, that induces a class of automata that are learnable in polynomial time.
منابع مشابه
The Open University ’ s repository of research publications and other research outputs Learn your opponent ’ s strategy ( in polynomial time ) !
Copyright and Moral Rights for the articles on this site are retained by the individual authors and/or other copyright owners. For more information on Open Research Online's data policy on reuse of materials please consult the policies page. Abstract Agents that interact in a distributed environment might increase their utility by behaving optimally given the strategies of the other agents. To ...
متن کاملoutputs Learn your opponent ’ s strategy ( in polynomial time ) !
Copyright and Moral Rights for the articles on this site are retained by the individual authors and/or other copyright owners. For more information on Open Research Online's data policy on reuse of materials please consult the policies page. Abstract Agents that interact in a distributed environment might increase their utility by behaving optimally given the strategies of the other agents. To ...
متن کاملRobust Opponent Modeling in Real-Time Strategy Games using Bayesian Networks
Opponent modeling is a key challenge in Real-Time Strategy (RTS) games as the environment is adversarial in these games, and the player cannot predict the future actions of her opponent. Additionally, the environment is partially observable due to the fog of war. In this paper, we propose an opponent model which is robust to the observation noise existing due to the fog of war. In order to cope...
متن کاملLearn Your Opponent's Strategy (in Polynomial Time)! Conference Item Learn Your Opponent's Strategy(in Polynomial Time)!
Copyright and Moral Rights for the articles on this site are retained by the individual authors and/or other copyright owners. For more information on Open Research Online's data policy on reuse of materials please consult the policies page. Abstract Agents that interact in a distributed environment might increase their utility by behaving optimally given the strategies of the other agents. To ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996